Stability in Queueing Networks via the Finite Decomposition Property
نویسندگان
چکیده
Determination of the stability behavior of a queueing network is an important part of analyzing such systems. In Gamarnik and Hasenbein (2005) it is shown if a fluid network has the finite decomposition property (FDP) and is not weakly stable, then any queueing network associated with the fluid network is not rate stable. In that paper the FDP was demonstrated for two station queueing networks only. In this paper, we show that the property holds for certain classes of queueing networks with any number of stations, thus allowing one to completely analyze the global stability of such queueing networks via the fluid model. Short Title: Fluid Networks
منابع مشابه
Stability of Adversarial Queues via Fluid Models
The subject of this paper is stability properties of adversarial queueing networks. Such queueing systems are used to model packet switch communication networks, in which packets are generated and routed dynamically, and have become a subject of research focus recently. Adversarial queueing networks are defined to be stable, if the number of packets stays bounded over time. A central question i...
متن کاملRobust stability of fuzzy Markov type Cohen-Grossberg neural networks by delay decomposition approach
In this paper, we investigate the delay-dependent robust stability of fuzzy Cohen-Grossberg neural networks with Markovian jumping parameter and mixed time varying delays by delay decomposition method. A new Lyapunov-Krasovskii functional (LKF) is constructed by nonuniformly dividing discrete delay interval into multiple subinterval, and choosing proper functionals with different weighting matr...
متن کاملStability and Capacity Regions or Discrete Time Queueing Networks
We consider stability and network capacity in discrete time queueing systems. Relationships between four common notions of stability are described. Specifically, we consider rate stability, mean rate stability, steady state stability, and strong stability. We then consider networks of queues with random events and control actions that can be implemented over time to affect arrivals and service ...
متن کاملCross-layer Congestion Control, Routing and Scheduling Design in Ad Hoc Wireless Networks
This paper considers jointly optimal design of crosslayer congestion control, routing and scheduling for ad hoc wireless networks. We first formulate the rate constraint and scheduling constraint using multicommodity flow variables, and formulate resource allocation in networks with fixed wireless channels (or single-rate wireless devices that can mask channel variations) as a utility maximizat...
متن کاملAn Efficient and Accurate Decomposition Method for Open Finite- and Infinite-Buffer Queueing Networks
We address a decomposition approach for the evaluation of large, open networks of mixed finiteand infinite-buffer queues with phase-type distributed service and interarrival times. Such queueing networks can be seen as high-level specifications of continuous-time Markov chains (CTMCs). However, these CTMCs can become very large (in case all buffers are finite) or even infinitely large. To avoid...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- APJOR
دوره 25 شماره
صفحات -
تاریخ انتشار 2008